//
// (C) Copyright 2009 Irantha Suwandarathna (irantha@gmail.com)
// All rights reserved.
//

/* Copyright (c) 1995-2000, The Hypersonic SQL Group.
 * All rights reserved.
 *
 * Redistribution and use _in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * Redistributions _in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer _in the documentation
 * and/or other materials provided with the distribution.
 *
 * Neither the name of the Hypersonic SQL Group nor the names of its
 * contributors may be used to endorse or promote products derived from this
 * software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE HYPERSONIC SQL GROUP,
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * This software consists of voluntary contributions made by many individuals
 * on behalf of the Hypersonic SQL Group.
 *
 *
 * For work added by the HSQL Development Group:
 *
 * Copyright (c) 2001-2008, The HSQL Development Group
 * All rights reserved.
 *
 * Redistribution and use _in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * Redistributions _in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer _in the documentation
 * and/or other materials provided with the distribution.
 *
 * Neither the name of the HSQL Development Group nor the names of its
 * contributors may be used to endorse or promote products derived from this
 * software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL HSQL DEVELOPMENT GROUP, HSQLDB.ORG,
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */


using System;
using EffiProz.Core.RowIO;
using EffiProz.Core.Persist;


namespace EffiProz.Core.Indexes
{

    /**
     *  Common MEMORY and TEXT table node implementation. Nodes are always in
     *  memory so an Object reference is used to access the other Nodes _in the
     *  AVL tree.
     *
     *  New class derived from the Hypersonic code
     *
     * @author Thomas Mueller (Hypersonic SQL Group)
     * @version    1.7.2
     * @since Hypersonic SQL
     */
    public abstract class NodeAVLBaseMemory : NodeAVL
    {

        protected NodeAVL nLeft;
        protected NodeAVL nRight;
        protected NodeAVL nParent;

        public override void delete()
        {
            iBalance = 0;
            nLeft = nRight = nParent = null;
        }

        public override NodeAVL getLeft(PersistentStore store)
        {          
            return nLeft;
        }

        public override NodeAVL setLeft(PersistentStore persistentStore, NodeAVL n)
        {
            nLeft = n;
            return this;
        }

        public override int getBalance(PersistentStore store)
        {
            return iBalance;
        }

        public override bool isLeft(NodeAVL node)
        {
            return nLeft == node;
        }

        public override bool isRight(NodeAVL node)
        {
            return nRight == node;
        }

        public override NodeAVL getRight(PersistentStore persistentStore)
        {
            return nRight;
        }

        public override NodeAVL setRight(PersistentStore persistentStore, NodeAVL n)
        {
            nRight = n;
            return this;
        }

        public override NodeAVL getParent(PersistentStore store)
        {
            return nParent;
        }

        public override bool isRoot(PersistentStore store)
        {
            return nParent == null;
        }

        public override NodeAVL setParent(PersistentStore store, NodeAVL n)
        {
            nParent = n;
            return this;
        }

        public override NodeAVL setBalance(PersistentStore store, int b)
        {
            iBalance = b;
            return this;
        }

        public override bool isFromLeft(PersistentStore store)
        {
            if (this.isRoot(store))
            {
                return true;
            }

            NodeAVL parent = getParent(store);

            return Equals(parent.getLeft(store));
        }

        public override NodeAVL set(PersistentStore store, bool isLeft, NodeAVL n)
        {

            if (isLeft)
            {
                nLeft = n;
            }
            else
            {
                nRight = n;
            }

            if (n != null)
            {
                ((NodeAVLBaseMemory)n).nParent = this;
            }

            return this;
        }

        public override void replace(PersistentStore store, Index index, NodeAVL n)
        {

            if (nParent == null)
            {
                if (n != null)
                {
                    n = n.setParent(store, null);
                }

                store.setAccessor(index, n);
            }
            else
            {
                getParent(store).set(store, isFromLeft(store), n);
            }
        }

        public override bool Equals(NodeAVL n)
        {
            return n == this;
        }

        public override void setInMemory(bool _in) { }

        public override void write(RowOutputInterface outi) { }
    }
}
